Per-flow delay performance in traffic aggregates
نویسندگان
چکیده
Class-based traffic treatment frameworks such as Differentiated Service (DiffServ) have been proposed to resolve the poor scalability problem in the flow-based approach. Although the performance is differentiated in a class-based basis, the performance seen by individual flows in the same class may differ from that seen by the class and has not been well understood. We investigate this issue by simulation in a single node under FIFO, static priority, waiting time priority, and weighted fair queueing scheduling schemes. Our results indicate that such performance discrepancy occurs especially when flows joining the same class are heterogeneous, which is not uncommon considering that the same type of applications can generate traffic having very different statistical behaviors such as video traffic with different activity levels, or voice traffic with different compression schemes. We found that per-flow delay statistics, including the average and the 99 percentile delay, can be very different from the corresponding class delay statistics, depending on flow burstiness, overall traffic load, as well as the queue discipline. We also propose a solution to reduce the mean delay variance experienced by flows in the same class. Symposium: Internet Performance
منابع مشابه
Aggregate Flow Control: Improving Assurances for Differentiated Services Network
Differentiated Services Architecture is a simple, but novel, approach for providing service differentiation in an IP network. However, there are various issues to be addressed before any sophisticated end-to-end services can be offered. This work proposes an Aggregate Flow Control (AFC) technique with a Diffserv traffic conditioner to improve the bandwidth and delay assurance of differentiated ...
متن کاملStatistical Per-Flow Service Bounds in a Network with Aggregate Provisioning
Scalability concerns of QoS implementations have stipulated service architectures where QoS is not provisioned separately to each flow, but instead to aggregates of flows. This paper determines stochastic bounds for the service experienced by a single flow when resources are managed for aggregates of flows and when the scheduling algorithms used in the network are not known. Using a recently de...
متن کاملImpact of Optimally Minimizing Delay Times on Safety at Signalized Intersections in Urban Areas, Case Study: The City of Virginia Beach
Optimally minimizing delay times at signalized intersections can significantly improve both traffic flow and safety. However, most traffic flow optimizing tools do not measure the effect on safety. This study uses nonlinear programming (NLP) algorithms to optimally minimize delay times and employs both Safety performance functions (SPFs) and empirical Bayes (EB) before-after methodology to meas...
متن کاملWorst-case Analysis of Tandem Queueing Systems Using Network Calculus
In this chapter we show how to derive performance bounds for tandem queueing systems using Network Calculus, a deterministic theory for performance analysis. We introduce the basic concepts of Network Calculus, namely arrival and service curves, and we show how to use them to compute performance bounds in an end-to-end perspective. As an application of the above theory, we evaluate tandems of n...
متن کاملToughness Performance of Recycled Aggregates for use in Road Pavement
The policy of driving organization such as Highways Agency is towards the use of performance related specifications. This policy and adoption of European wide aggregate standards on the one hand, and sustainable construction pressures on the other, all strongly emphasize on further need for more developments to specifications and performance assessment methodologies inst...
متن کامل